Folding Polyominoes into (Poly)Cubes
نویسندگان
چکیده
We study the problem of folding a given polyomino S into a polycube C under different folding models, allowing faces of C to be covered multiple times.
منابع مشابه
My Parade of Algorithmic Mathematical Art
Animations are discussed for a range of geometric dissections. These include a variety of twist-hinged dissections, some swing-hinged dissections, dissections of squares and cubes corresponding to a certain integer identities, folding dissections of multi-level regular polygons, and folding dissections of multi-level polyominoes. Artistic issues pertaining to these dissections and animations ar...
متن کاملRep-cubes: Unfolding and Dissection of Cubes
Last year, a new notion of rep-cube was proposed. A rep-cube is a polyomino that is a net of a cube, and it can be divided into some polyominoes such that each of them can be folded to a cube. This notion was inspired by the notions of polyomino and rep-tile, which were introduced by Solomon W. Golomb. It was proved that there are infinitely many distinct rep-cubes. In this paper, we investigat...
متن کاملEnumeration of minimal 3D polyominoes inscribed in a rectangular prism
We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size b×k×h and of minimal volume equal to b + k + h − 2. They extend the concept of minimal 2D polyominoes inscribed in a rectangle studied in a previous work. Using their geometric structur...
متن کاملCommon Unfoldings of Polyominoes and Polycubes
Abstract. This paper studies common unfoldings of various classes of polycubes, as well as a new type of unfolding of polyominoes. Previously, Knuth and Miller found a common unfolding of all tree-like tetracubes. By contrast, we show here that all 23 tree-like pentacubes have no such common unfolding, although 22 of them have a common unfolding. On the positive side, we show that there is an u...
متن کاملGuarding Polyominoes, Polycubes and Polyhypercubes
We consider variations of the original art gallery problem where the domain is a polyomino, a polycube, or a polyhypercube. Anm-polyomino is the connected union of m unit squares called pixels, an m-polycube is the connected union of m unit cubes called voxels, and an m-polyhypercube is the connected union of m unit hypercubes in a d dimensional Euclidean space. In this paper we generalize and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1712.09317 شماره
صفحات -
تاریخ انتشار 2015